Cycles in hamiltonian graphs of prescribed maximum degree
نویسندگان
چکیده
منابع مشابه
Cycles in hamiltonian graphs of prescribed maximum degree
Let G be a hamiltonian graph G of order n and maximum degree , and let C(G) denote the set of cycle lengths occurring in G. It is easy to see that |C(G)|¿ − 1. In this paper, we prove that if ¿n=2, then |C(G)|¿ (n + − 3)=2. We also show that for every ¿ 2 there is a graph G of order n¿ 2 such that |C(G)|= − 1, and the lower bound in case ¿n=2 is best possible. c © 2003 Elsevier Science B.V. All...
متن کاملLong cycles in graphs with prescribed toughness and minimum degree
A cycle C of a graph G is a D~-cycle if every component of G V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2 2 for some 2 ~< t + 1, then G contains a Dx-cycle. In particular, if 6>n/(t+ 1)--1, then G is ham...
متن کاملHamiltonian cycles in regular graphs of moderate degree
In this paper we prove that if k is an integer no less than 3, and if G is a two-connected graph with 2n a vertices, a E {0, 1}, which is regular of degree n k, then G is Hamiltonian if a = 0 and n > k2 + k + 1 or if a = I and n > 2k 2 3k =, 3 . We use the notation and terminology of [1] . Gordon [4] has proved that there are only a small number of exceptional graphs with 2n vertices which are ...
متن کاملHamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
In [6], Thomassen conjectured that if I is a set of k − 1 arcs in a k-strong tournament T , then T − I has a Hamiltonian cycle. This conjecture was proved by Fraisse and Thomassen [3]. We prove the following stronger result. Let T = (V, A) be a k-strong tournament on n vertices and let X1, X2, . . . , Xl be a partition of the vertex set V of T such that |X1| ≤ |X2| ≤ . . . ≤ |Xl|. If k ≥ ∑l−1 i...
متن کاملLong Cycles in Hamiltonian Graphs
We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00817-8